Flow Theory - Networking, IEEE/ACM Transactions on
نویسندگان
چکیده
We develop a simple theory of flows to study the flow of data in real-time computing networks. Flow Theory is based on discrete and nondeterministic mathematics, rather than the customary continuous or probabilistic mathematics. The theory features two types of flows: smooth and uniform, and eight types of flow operators. We prove that, if the input flow to any of these operators is smooth or uniform, then both the internal buffer and delay of that operator are bounded. Linear networks of flow operators are introduced, and their internal buffers and delays are derived from the internal buffers and delays of their constituent operators. We extend Flow Theory so that it can be used in analyzing cyclic networks and networks of multiflows. Since many rate-reservation protocols can be represented as linear networks of flow operators, we use Flow Theory to prove that a number of these protocols (Stop-and-Go, Hierarchical RoundRobin, Weighted Fair Queueing, Self-Clocking Fair Queueing, and Virtual Clock) require bounded buffering and introduce bounded delay.
منابع مشابه
IEEE/ACM TRANSACTIONS ON NETWORKING. VOL. 3, NO, 4. AUGUST 1995 423 Optimal Flow Control Schemes that
متن کامل
On Credibility of Simulation Studies of Telecommunication Networks
In telecommunication networks, as in many other areas of science and engineering, proliferation of computers as research tools has resulted in the adoption of computer simulation as the most commonly used paradigm of scientific investigations. This, together with a plethora of existing simulation languages and packages, has created a popular opinion that simulation is mainly an exercise in comp...
متن کاملIEEE/ACM Transactions on Computational Biology and Bioinformatics. Editorial from the Editor-in-Chief.
متن کامل
TECHNICAL REPORT LSU-ECE-95-163* Congested Banyan Network Analysis Using Congested-Queue States and Neighboring-Queue Effects
A banyan network analysis technique is presented which more accurately models a congested network than other reported techniques. The analysis is based on the observation that a full queue (within the switching modules making up the network) causes traffic to back up. For a short time after becoming full the free space in the queue is limited to no more than one slot. A queue in such a conditio...
متن کاملCryptanalysis of RSA with Small Prime Difference using Unravelled Linearization
R. Rivest, A. Shamir and L. Adleman," A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of the ACM, vol. 21, No. 2, pp. 120-126,1978. Wiener, M. : Cryptanalysis of short RSA secret exponents, IEEE Transactions on Information Theory 36, 553-558 (1990). Boneh, D. , Durfee, G. : Cryptanalysis of RSA with Private Key d Less Than N^0. 292, Advances in ...
متن کامل